Cyclo-Dynamic Dataflow

نویسندگان

  • Piet Wauters
  • Marc Engels
  • Rudy Lauwereins
  • Jean A. Peperstraete
چکیده

In this paper we present cyclo-dynamic data flow (CDDF), a new data flow model for real time digital signal processing (DSP) applications. CDDF is an extension of cyclo-static dataflow (CSDF) [1,2] which keeps the interesting properties like analyzability and efficient compile time scheduling, while introducing data dependent control flow to improve the expressivity. The semantics are constructed such that extra knowledge about the internals of the actors, which is known to the programmer, can be expressed both in a natural way, and in a syntax that can be analyzed by automatic tools. In this paper we describe the proposed model in the context of already existing data flow languages, demonstrate its schedulability and its improved analyzability as compared to the Boolean data flow model [3].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classification of Dataflow Actors with Satisfiability and Abstract Interpretation

Dataflow programming has been used to describe signal processing applications for many years, traditionally with cyclo-static dataflow (CSDF) or synchronous dataflow (SDF) models that restrict expressive power in favor of compile-time analysis and predictability. More recently, dynamic dataflow is being used for the description of multimedia video standards as promoted by the RVC standard (ISO/...

متن کامل

Throughput Constrained Parallelism Reduction in Cyclo-static Dataflow Applications

This paper deals with semantics-preserving parallelism reduction methods for cyclo-static dataflow applications. Parallelism reduction is the process of equivalent actors fusioning. The principal objectives of parallelism reduction are to decrease the memory footprint of an application and to increase its execution performance. We focus on parallelism reduction methodologies constrained by appl...

متن کامل

Parameterized dataflow modeling for DSP systems

Dataflow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of dataflow, termed synchronous dataflow (SDF), that offers strong compile-time predictability properties, but has limited expressive power, has been studied extensively in the DSP context. Many extensions to synchronous dataflow have been proposed to incr...

متن کامل

Parameterized Modeling and Scheduling for Dataflow Graphs

Dataflow has proven to be an attractive computational model for programming DSP applications. A restricted version of dataflow, called Synchronous Dataflow (SDF) is particularly well-suited for modeling a large class of signal processing applications, as it offers strong formal properties and compile-time predictability. Efficient techniques have been developed for generating software implement...

متن کامل

Parameterized Modeling and Scheduling for Dataflow Graphs1

Dataflow has proven to be an attractive computational model for programming DSP applications. A restricted version of dataflow, called Synchronous Dataflow (SDF) is particularly well-suited for modeling a large class of signal processing applications, as it offers strong formal properties and compile-time predictability. Efficient techniques have been developed for generating software implement...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996